Preconditioned Parallel Block-jacobi Svd Algorithm
نویسندگان
چکیده
We show experimentally, that the QR factorization with the complete column pivoting, optionally followed by the LQ factorization of the Rfactor, can lead to a substantial decrease of the number of outer parallel iteration steps in the parallel block-Jacobi SVD algorithm, whereby the details depend on the condition number and on the shape of spectrum, including the multiplicity of singular values. Best results were achieved for well-conditioned matrices with a multiple minimal singular value, where the number of parallel iteration steps has been reduced by two orders of magnitude. However, the gain in speed, as measured by the total parallel execution time, depends decisively on how efficient is the implementation of the distributed QR and LQ factorizations on a given parallel architecture. In general, the reduction of the total parallel execution time up to one order of magnitude has been achieved.
منابع مشابه
Dynamic Ordering for the Parallel One-sided Block-jacobi Svd Algorithm
The serial Jacobi algorithm (either one-sided or two-sided) for the computation of a singular value decomposition (SVD) of a general matrix has excellent numerical properties and parallelization potential, but it is considered to be the slowest method for computing the SVD. Even its parallelization with some parallel cyclic (static) ordering of subproblems does not lead to much improvement when...
متن کاملParallel Code for One-sided Jacobi-Method
One sided block Jacobi algorithm for the singular value decomposition (SVD) of matrix can be a method of choice to compute SVD efficiently and accurately in parallel. A given matrix is logically partitioned into block columns and is subjected to an iteration process. In each iteration step, for given two block columns, their Gram matrix is generated, its symmetric eigenvalue decomposition (EVD)...
متن کاملParallel One-Sided Block Jacobi SVD Algorithm: II. Implementation
This technical report is devoted to the description of implementation details of the accelerated parallel one-sided block Jacobi SVD algorithm, whose analysis and design was described in [21]. We provide discuss a suitable data layout for a parallel implementation of the algorithm on a parallel computer with distributed memory. This discussion is complicated by the fact that different computati...
متن کاملGeneralization of the Dynamic Ordering for the One-Sided Block Jacobi SVD Algorithm: I. Analysis and Design
The efficiency of the one-sided parallel block-Jacobi algorithm for computation of the singular value decomposition (SVD) of a general matrix A ∈ Rm×n, m ≥ n, depends–besides some numerical tricks that speed-up the convergence–crucially on the parallel ordering of subproblems, which are to be solved in each parallel iteration step. We discuss in detail possible generalizations of the so-called ...
متن کاملNew Fast and Accurate Jacobi Svd Algorithm: Ii. Lapack Working Note 170
This paper presents new implementation of one–sided Jacobi SVD for triangular matrices and its use as the core routine in a new preconditioned Jacobi SVD algorithm, recently proposed by the authors. New pivot strategy exploits the triangular form and uses the fact that the input triangular matrix is the result of rank revealing QR factorization. If used in the preconditioned Jacobi SVD algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 16 شماره
صفحات -
تاریخ انتشار 2006